Hyperelliptic Curves and Cryptography
نویسندگان
چکیده
In 1989, Koblitz proposed using the jacobian of a hyperelliptic curve defined over a finite field to implement discrete logarithm cryptographic protocols. This paper provides an overview of algorithms for performing the group law (which are necessary for the efficient implementation of the protocols), and algorithms for solving the hyperelliptic curve discrete logarithm problem (whose intractability is essential for the security of the protocols). Also considered are destructive applications of hyperelliptic curves—solving instances of the elliptic curve discrete logarithm by using the technique of Weil descent to reduce them to instances of the hyperelliptic curve discrete logarithm problem.
منابع مشابه
Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem
The Diffie-Hellman problem as a cryptographic primitive plays an important role in modern cryptology. The Bit Security or Hard-Core Bits of Diffie-Hellman problem in arbitrary finite cyclic group is a long-standing open problem in cryptography. Until now, only few groups have been studied. Hyperelliptic curve cryptography is an alternative to elliptic curve cryptography. Due to the recent crypt...
متن کاملPairings on hyperelliptic curves
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many direction...
متن کاملIsomorphism Classes of Hyperelliptic Curves of Genus 2 over Fq
We give the exact number and representatives of the isomorphism, which preserves infinity, classes of hyperelliptic curves of genus 2 over finite fields with characteristic 2 in most cases. These results have applications to hyperelliptic curve cryptography.
متن کاملHyperelliptic Curve Cryptography
The use of elliptic-curve groups in cryptography, suggested by Miller [1] and Koblitz [2] three decades ago,provides the same level of security for the Discrete Logarithm Problem as multiplicative groups, with much smallerkey sizes and parameters. The idea was refined two years later by Koblitz, who worked with the group formed bythe points of the Jacobian of hyperelliptic curve...
متن کاملCorrespondences on Hyperelliptic Curves and Applications to the Discrete Logarithm
The discrete logarithm is an important crypto primitive for public key cryptography. The main source for suitable groups are divisor class groups of carefully chosen curves over finite fields. Because of index-calculus algorithms one has to avoid curves of genus ≥ 4 and non-hyperelliptic curves of genus 3. An important observation of Smith [S] is that for “many” hyperelliptic curves of genus 3 ...
متن کاملA Study of Hyperelliptic Curves in Cryptography
Elliptic curves are some specific type of curves known as hyper elliptic curves. Compared to the integer factorization problem(IFP) based systems, using elliptic curve based cryptography will significantly decrease key size of the encryption. Therefore, application of this type of cryptography in systems that need high security and smaller key size has found great attention. Hyperelliptic curve...
متن کامل